Connected but not path-connected subspaces of infinite graphs
نویسندگان
چکیده
منابع مشابه
Connected but not path-connected subspaces of infinite graphs
Solving a problem of Diestel [8] we show that the Freudenthal compactification of a locally finite graph can have connected subsets that are not path-connected. However we prove that connectedness and pathconnectedness do coincide for all but a few sets, which have a complicated structure.
متن کاملSpaces That Are Connected but Not Path-connected
A topological space X is called connected if it’s impossible to write X as a union of two nonempty disjoint open subsets: if X = U ∪ V where U and V are open subsets of X and U ∩ V = ∅ then one of U or V is empty. Intuitively, this means X consists of one piece. A subset of a topological space is called connected if it is connected in the subspace topology. The most fundamental example of a con...
متن کاملDecomposing Infinite 2-Connected Graphs into 3-Connected Components
In the 1960’s, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on 2-connected graphs to problems on 3-connected graphs. Motivated by a problem concerning accumulation points of infinite planar graphs, we generalize Tutte’s decomposition to include all infinite 2-connected graphs.
متن کاملMulticorns are not path connected
The tricorn is the connectedness locus in the space of antiholomorphic quadratic polynomials z 7! z2 + c. We prove that the tricorn is not locally connected and not even pathwise connected, confirming an observation of John Milnor from 1992. We extend this discussion more generally for antiholomorphic unicritical polynomials of degrees d 2 and their connectedness loci, known as multicorns.
متن کاملCOMPLEXES OF NOT i-CONNECTED GRAPHS
Complexes of (not) connected graphs, hypergraphs and their ho-mology appear in the construction of knot invariants given by V. Vassiliev V1, V2, V4]. In this paper we study the complexes of not i-connected k-hypergraphs on n vertices. We show that the complex of not 2-connected graphs has the homotopy type of a wedge of (n ? 2)! spheres of dimension 2n ? 5. This answers a question raised by Vas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2007
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-007-2188-6